منابع مشابه
Scheduling heterogeneous processors isn't as easy as you think
We consider preemptive online scheduling algorithms to minimize the total weighted/unweighted flow time plus energy for speed-scalable heterogeneous multiprocessors. We show that the well-known priority scheduling algorithms Highest Density First, Weighted Shortest Elapsed Time First, and Weighted Late Arrival Processor Sharing, are not O(1)-speed O(1)-competitive for the objective of weighted ...
متن کاملFeeding people is easy: but we have to re-think the world from first principles.
OBJECTIVE Agriculture designed to make best use of landscape and to be maximally sustainable would also provide food of the highest nutritional and gastronomic standards, and would inevitably employ a great many people. Thus it would solve the world's food problems, and its principal social problem, at a stroke. But agriculture in practice is designed for a quite different purpose--to generate ...
متن کاملThink about Neurobrucellosis, When a Man Cries
Neurobrucellosis (N.B) is a rare and severe form of systemic Brucella infection. We introduced an unusual case that “Psychologic Symptoms” was the most prominent complaints of his family. He was a 50-year-old man who has worked in butchery. His problems had begun 2 months prior to his admission with mood disorders, arthralgia, weakness, headache, and night sweats; he has recurrent crying with n...
متن کاملTransfers and Development Easy Come , Easy Go ?
A central behavioral assumption of economic theory is that income is fungible. Yet, building on the pioneering work by Thaler (1999) recent work by behavioural economists highlights that people code income in different mental accounts, creating a direct link between spending behaviour and income sources, thereby violating the fungibility assumption. This paper examines whether the marginal prop...
متن کاملEasy Sets Without Easy Small Subsets
We show the existence of relativized worlds relative to which there exist innnite polynomial-time computable sets without innnite polynomial-time computable sparse subsets or even non-deterministically polynomial-time computable sparse subsets. This result is tight since every innnite P set has an innnite sparse coNP subset.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Sport- und Präventivmedizin
سال: 2010
ISSN: 1867-1977,1867-1985
DOI: 10.1007/s12534-010-0085-z